Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields

نویسندگان

  • Ekkasit Sangwisut
  • Somphong Jitman
  • Patanee Udomkavanich
چکیده

Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing xn − λ over Fq2 is given, where λ is a unit in Fq2 . Based on this factorization, the dimensions of the Hermitian hulls of λ-constacyclic codes of length n over Fq2 are determined. The characterization and enumeration of constacyclic Hermitian self-dual (resp., complementary dual) codes of length n over Fq2 are given through their Hermitian hulls. Subsequently, a new family of MDS constacyclic Hermitian self-dual codes over Fq2 is introduced. As a generalization of constacyclic codes, quasi-twisted Hermitian self-dual codes are studied. Using the factorization of xn − λ and the Chinese Remainder Theorem, quasi-twisted codes can be viewed as a product of linear codes of shorter length some over extension fields of Fq2 . Necessary and sufficient conditions for quasi-twisted codes to be Hermitian self-dual are given. The enumeration of such self-dual codes is determined as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skew constacyclic codes over Galois rings

We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...

متن کامل

New MDS Euclidean and Hermitian self-dual codes over finite fields

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic codes. And we give some results on Hermitian self-dual codes, which are the extended cyclic duadic codes.

متن کامل

Skew constacyclic codes over finite chain rings

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of x − λ, where λ is a unit element, are exhibited. When λ = 1, the generators of Euclidean and Hermitian dual codes of such codes are determined tog...

متن کامل

On the codes over the Z_3+vZ_3+v^2Z_3

In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R = Z3+vZ3+v 2 Z3, v 3 = v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasicyclic and skew constacyclic codes over R are obtained. A necessary and sufficient condition for cyclic (negacyclic) codes over R that contains its dual has been given. The paramete...

متن کامل

Galois LCD codes over finite fields

In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. in Math. of Comm.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2017